A Hybrid Approach for Software Project Scheduling
نویسندگان
چکیده
منابع مشابه
A Hybrid Approach for Software Project Scheduling
This research work handles Software project scheduling problem with a hybrid approach. In this, a hybrid approach can handle combination of two different algorithms they are Event Based Scheduler(EBS) and Ant Colony Optimization(ACO). Which provide scheduling and also allocate the resources based on the project. The basic idea of the EBS is to adjust the allocation of employees at events and ke...
متن کاملA Hybrid Ant Colony Optimization Algorithm for Software Project Scheduling
The extraction of comprehensible knowledge is one of the major challenges in many domains. In this concept, an ant programming (AP) framework, which is capable of mining classification rules easily comprehensible by humans, and, therefore, capable of supporting expert-domain decisions, is presented. The algorithm proposed, called grammar based ant programming (GBAP), is the first AP algorithm d...
متن کاملA Multi-objective Approach to the Software Project Scheduling Problem
The Software Project Scheduling (SPS) problem relates to the decision of who does what during a software project lifetime. This problem has a capital importance for software companies. In the SPS problem, the total budget and human resources involved in software development must be managed optimally in order to end up with a successful project. Companies are mainly concerned with reducing both ...
متن کاملA stochastic model for project selection and scheduling problem
Resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. In this study, budget, investment costs and earnings are considered to be stochastic. The objectives are maximizing net present values of selected projects and minimizing v...
متن کاملA hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks
In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/9631-4321